Computing Nash equilibria through computational intelligence methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Nash equilibria through computational intelligence methods

Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, ...

متن کامل

Computing Nash Equilibria through Particle Swarm Optimization

This paper considers the application of a novel optimization method, namely Particle Swarm Optimization, to compute Nash equilibria. The problem of computing equilibria is formed as one of detecting the global minimizers of a real-valued, nonnegative, function. To detect more than one global minimizers of the function at a single run of the algorithm and address effectively the problem of local...

متن کامل

The Computational Complexity of Nash Equilibria

Game theory has grown in importance as academics from all fields have realized the importance of strategy in domains of human behavior ranging from business to the Internet. The computational issues of game theory are important to both a game’s participants and designers. A participant in a game, or their consultant, obviously wants to compute their optimal moves in anticipation of their opppon...

متن کامل

Computing Nash Equilibria of Unbounded Games

Using techniques from higher-type computability theory and proof theory we extend the well-known game-theoretic technique of backward induction to certain general classes of unbounded games. The main application is a closed formula for calculating strategy profiles in Nash equilibrium and subgame perfect equilibrium even in the case of games where the length of play is not a-priori fixed.

متن کامل

Computing Nash Equilibria for Stochastic Games

We present two new algorithms for computing Nash equilibria of stochastic games. One is a global random start algorithm based on nonlinear programming, while the other combines a dynamical system with nonlinear programming to find stable equilibria. Promising numerical results are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2005

ISSN: 0377-0427

DOI: 10.1016/j.cam.2004.06.005